Formal Concept Sampling for Counting and Threshold%2DFree Local Pattern Mining.

Privacy%2DPreserving Data%2DMining.
In this paper we address the issue of privacy preserving data mining. Specifically, we consider a  scenario in which two parties owning confidential databases wish to run a data mining algorithm on  the union of their databases, without revealing any unnecessary information. Our work is motivated  by the need to both protect privileged information and enable its use for research or other purposes. The
Non%2Dredundant Subgroup Discovery Using a Closure System.

On Subgroup Discovery in Numerical Domains.

On subgroup discovery in numerical domains.

Approximating the number of frequent sets in dense data.

Tight Optimistic Estimates for Fast Subgroup Discovery.
Abstract. Subgroup discovery is the task of finding subgroups of a population which exhibit both distributional unusualness and high generality. Due to the non monotonicity of the corresponding evaluation functions, standard pruning techniques cannot be used for subgroup discovery, requiring the use of optimistic estimate techniques instead. So far, however, optimistic estimate pruning has only been considered for the extremely simple case of a binary target attribute and up to now no attempt was made to move beyond suboptimal heuristic optimistic estimates. In this paper, we show that optimistic estimate pruning can be developed into a sound and highly effective pruning approach for subgroup discovery. Based on a precise definition of optimality we show that previous estimates have been tight only in special cases. Thereafter, we present tight optimistic estimates for the most popular binary and multi-class quality functions, and present a family of increasingly efficient approximations to these optimal functions. As we show in empirical experiments, the use of our newly proposed optimistic estimates can lead to a speed up of an order of magnitude compared to previous approaches. 1
A Randomized Approach for Approximating the Number of Frequent Sets.

Procurement Fraud Discovery using Similarity Measure Learning.
Abstract. This paper describes an approach to detect hints on procurement fraud. It was developed within the context of a European Union project on fraud prevention. Procurement fraud is a special kind of fraud that occurs when employees cheat their own employers by executing or triggering bogus payments. The approach presented here is based on the idea to learn a similarity measure that compares an employee (or payroll) standing-data record to a creditor record, in order to detect creditors that are suspiciously similar to employees. To this ends, it combines several simple similarity measures like address similarity or spacial similarity using a weighting scheme. The weights, that is the overall similarity function, are learned from user input specifying whether a particular pair of payroll and creditor data records are similar. Key words: similarity measure learning, fraud detection, health care 1
Procurement Fraud Discovery using Similarity Measure Learning.
Abstract. This paper describes an approach to detect hints on procurement fraud. It was developed within the context of a European Union project on fraud prevention. Procurement fraud is a special kind of fraud that occurs when employees cheat their own employers by executing or triggering bogus payments. The approach presented here is based on the idea to learn a similarity measure that compares an employee (or payroll) standing-data record to a creditor record, in order to detect creditors that are suspiciously similar to employees. To this ends, it combines several simple similarity measures like address similarity or spacial similarity using a weighting scheme. The weights, that is the overall similarity function, are learned from user input specifying whether a particular pair of payroll and creditor data records are similar. Key words: similarity measure learning, fraud detection, health care 1
Probabilistic Hybrid Action Models for Predicting Concurrent Percept%2Ddriven Robot Behavior.
This article develops Probabilistic Hybrid Action Models (PHAMs), a realistic causal model for predicting the behavior generated by modern percept-driven robot plans. PHAMs represent aspects of robot behavior that cannot be represented by most action models used in AI planning: the temporal structure of continuous control processes, their nondeterministic effects, and several modes of their interferences.
ccGolog %2D%2D A Logical Language Dealing with Continuous Change.

On%2DLine Execution of cc%2DGolog Plans.
Previously, the plan language cc-Golog was introduced  for the purpose of specifying event-driven  behavior typically found in robot controllers. So  far, however, cc-Golog is usable only for projecting  the outcome of a plan and it is unclear how to  actually execute plans on-line on a robot. In this  paper, we provide such an execution model for ccGolog   and, in addition, show how to interleave execution  with a new kind of time-bounded projection.
Belief Update in the pGOLOG Framework.
High-level controllers that operate robots in dynamic,  uncertain domains are concerned with at  least two reasoning tasks dealing with the effects of  noisy sensors and effectors: They have a) to project  the effects of a candidate plan and b) to update  their beliefs during on-line execution of a plan. In  this paper, we show how the pGOLOG framework,  which in its original form only accounted for the  projection of high-level plans, can be extended to  reason about the way the robot&#039;s beliefs evolve during  the on-line execution of a plan. pGOLOG, an  extension of the high-level programming language  GOLOG, allows the specification of probabilistic  beliefs about the state of the world and the representation  of sensors and effectors which have uncertain,  probabilistic outcomes. As an application  of belief update, we introduce belief-based programs,   GOLOG-style programs whose tests appeal  to the agent&#039;s beliefs at execution time.
Integrated Plan%2DBased Control of Autonomous Robots in Human Environments.
The authors extend the Rhino robot by adding the means for plan-based high-level control and plan transformation, further enhancing its probabilistic reasoning capabilities. The result: an autonomous robot capable of accomplish-ing prolonged, complex, and dynamically changing tasks in the real world.
cc%2DGolog Towards More Realistic Logic%2DBased Robot Controllers.

Probabilistic Hybrid Action Models for Predicting Concurrent Percept%2DDriven Robot Behavior.
This article develops Probabilistic Hybrid Action Models (PHAMs), a realistic causal model for predicting the behavior generated by modern percept-driven robot plans. PHAMs represent aspects of robot behavior that cannot be represented by most action models used in AI planning: the temporal structure of continuous control processes, their nondeterministic effects, and several modes of their interferences.
Turning High%2DLevel Plans into Robot Programs in Uncertain Domains.
. The actions of a robot like lifting an object are often best thought of as low-level processes with uncertain outcome. A highlevel robot plan can be seen as a description of a task which combines these processes in an appropriate way and which may involve nondeterminism in order to increase a plan&#039;s generality. In a given situation, a robot needs to turn a given plan into an executable program for which it can establish, through some form of projection, that it satisfies a given goal with some probability. In this paper we will show how this can be achieved in a logical framework. In particular, low-level processes are modelled as programs in pGOLOG, a probabilistic variant of the action language GOLOG. High-level plans are like ordinary GOLOG programs except that during projection the names of low-level processes are replaced by their pGOLOG- definitions.  1 Introduction  The actions of a robot like lifting an object are often best thought of as low-level processes with uncertain ou...
cc%2DGolog Towards More Realistic Logic%2DBased Robot Controllers

Towards more Realistic Logic%2Dbased Robot Controllers in the GOLOG Framework.
this paper, we show how these issues can be dealt with in the GOLOG frameworkby proposing appropriate extensions of the language.
Probabilistic
Abstract. This paper presents a Bayesian method for constructing probabilistic networks from databases. In particular, we focus on constructing Bayesian belief networks. Potential applications include computer-assisted hypothesis testing, automated scientific discovery, and automated construction of probabilistic expert systems. We extend the basic method to handle missing data and hidden (latent) variables. We show how to perform probabilistic inference by averaging over the inferences of multiple belief networks. Results are presented of a preliminary evaluation of an algorithm for constructing a belief network from a database of cases. Finally, we relate the methods in this paper to previous work, and we discuss open problems.
Probabilistic
Abstract. This paper presents a Bayesian method for constructing probabilistic networks from databases. In particular, we focus on constructing Bayesian belief networks. Potential applications include computer-assisted hypothesis testing, automated scientific discovery, and automated construction of probabilistic expert systems. We extend the basic method to handle missing data and hidden (latent) variables. We show how to perform probabilistic inference by averaging over the inferences of multiple belief networks. Results are presented of a preliminary evaluation of an algorithm for constructing a belief network from a database of cases. Finally, we relate the methods in this paper to previous work, and we discuss open problems.


